Convex-Arc Drawings of Pseudolines
نویسندگان
چکیده
Introduction. A pseudoline is formed from a line by stretching the plane without tearing: it is the image of a line under a homeomorphism of the plane [13]. In arrangements of pseudolines, pairs of pseudolines intersect at most once and cross at their intersections. Pseudoline arrangements can be used to model sorting networks [1], tilings of convex polygons by rhombi [4], and graphs that have distance-preserving embeddings into hypercubes [6]. They are also closely related to oriented matroids [11]. We consider here the visualization of arrangements using well-shaped curves. Primarily, we study weak outerplanar pseudoline arrangements. An arrangement is weak if it does not necessarily have a crossing for every pair of pseudolines [12], and outerplanar if every crossing is part of an unbounded face of the arrangement. We show that these arrangements can be drawn with all curves convex, either as polygonal chains with at most two bends per pseudoline or as semicircles above a line. Arbitrary pseudolines can also be drawn as convex curves, but may require linearly many bends.
منابع مشابه
An homotopy theorem for arrangements of double pseudolines
We define a double pseudoline as a simple closed curve in the open Möbius band homotopic to the double of its core circle, and we define an arrangement of double pseudolines as a collection of double pseudolines such that every pair crosses in 4 points – the crossings being transversal – and induces a cell decomposition of the Möbius band whose 2-dimensional cells are 2-balls, except the unboun...
متن کاملArrangements of double pseudolines
An arrangement of double pseudolines is a finite family of at least two homotopically trivial simple closed curves embedded in the real projective plane, with the property that any two meet exactly four times, at which points they meet transversely, and induce a cell structure on the real projective plane. In this talk I will show that any arrangement of double pseudolines is isomorphic to the ...
متن کاملMorphing Planar Graphs in Spherical Space
We consider the problem of intersection-free planar graph morphing, and in particular, a generalization from Euclidean space to spherical space. We show that there exists a continuous and intersectionfree morph between two sphere drawings of a maximally planar graph, provided that both sphere drawings have convex inscribed polytopes, where sphere drawings are the spherical equivalent of plane d...
متن کاملAligned Drawings of Planar Graphs
Let G be a graph embedded in the plane and let A be an arrangement of pseudolines intersecting the drawing of G. An aligned drawing of G and A is a planar polyline drawing Γ of G with an arrangement A of lines so that Γ and A are homeomorphic to G and A. We show that if A is stretchable and every edge e either entirely lies on a pseudoline or intersects at most one pseudoline, then G and A have...
متن کاملOrder Types and Visibility Types of Conngurations of Disjoint Convex Plane Sets Order Types and Visibility Types of Conngurations of Disjoint Convex Plane Sets Extended Abstract
We introduce the notions of order type (or: dual arrangement) and visibility type (or: tangent visibility graph) for conngurations of disjoint convex sets in the plane. We develop optimal algorithms for computing and sweeping the order type, and also give a worst case optimal algorithm for computing the tangent visibility graph. The methods are based on a relation, introduced in this paper, bet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1601.06865 شماره
صفحات -
تاریخ انتشار 2013